New technique for solving univariate global optimization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

A New Global Optimization Algorithm for Solving Generalized Geometric Programming

A global optimization algorithm for solving generalized geometric programming GGP problem is developed based on a new linearization technique. Furthermore, in order to improve the convergence speed of this algorithm, a new pruning technique is proposed, which can be used to cut away a large part of the current investigated region in which the global optimal solution does not exist. Convergence ...

متن کامل

a new hybrid flower pollination algorithm for solving constrained global optimization problems

global optimization methods play an important role to solve many real-world problems. flower pollination algorithm (fp) is a new nature-inspired algorithm, based on the characteristics of flowering plants. in this paper, a new hybrid optimization method called hybrid flower pollination algorithm (fppso) is proposed. the method combines the standard flower pollination algorithm (fp) with the par...

متن کامل

Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints

Abstract. In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. Two sets of test problems are introduced, in the first one both the objective function and constraints are differentiable functions and in the second one they are non-differentiable. Each series of tests contains 3 problems...

متن کامل

Explicit Univariate Global Optimization with Piecewise Linear Support Functions

Piecewise linear convex and concave support functions combined with Pijavskii’s method are proposed to be used for solving global optimization problems. Rules for constructing support functions are introduced.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archivum Mathematicum

سال: 2017

ISSN: 0044-8753,1212-5059

DOI: 10.5817/am2017-1-19